Code loops are RA2 loops

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A-loops close to code loops are groups

Let Q be a diassociative A-loop which is centrally nilpotent of class 2 and which is not a group. Then the factor over the centre cannot be an elementary abelian 2-group.

متن کامل

Direct construction of code loops

Code loops were introduced by R. L. Griess. Griess [5] and Hsu [7] gave methods to construct the corresponding code loop from any given doubly even binary code; both these methods used some kind of induction. In this paper, we present a global construction of the loop, where we apply the correspondance between the concepts of Moufang loops and groups with triality.

متن کامل

Code Loops in Both Parities

We present equivalent definitions of code loops in any characteristic p 6= 0. The most natural definition is via combinatorial polarization, but we also show how to realize code loops by linear codes and as a class of symplectic conjugacy closed loops. For p odd, it is possible to define code loops via characteristic trilinear forms. Related concepts are discussed.

متن کامل

Combinatorial Aspects of Code Loops

The existence and uniqueness (up to equivalence defined below) of code loops was first established by R. Griess in [3]. Nevertheless, the explicit construction of code loops remained open until T.Hsu introduced the notion of symplectic cubic spaces and their Frattini extensions, and pointed out how the construction of code loops followed from the (purely combinatorial) result of O. Chein and E....

متن کامل

Characterization of Program Loops in Code Optimization

-Recent work in code optimization has led to development of new unified optimizing transformations[6,7]. Application of these transformations requires solution of bi-directional data flow problems over program flow graphs using iterative solution techniques. Appropriate characterization of program loops in the flow graph is necessary so as (i) not to hinder code movement, etc., and (ii) restric...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1990

ISSN: 0021-8693

DOI: 10.1016/0021-8693(90)90088-6